منابع مشابه
Matrix Completion Problems
Matrix completion problems are concerned with determining whether partially speciied matrices can be completed to fully speciied matrices satisfying certain prescribed properties. In this article we survey some results and provide references about these problems for the following matrix properties: positive semideenite matrices, Euclidean distance matrices, completely positive matrices, contrac...
متن کاملEuclidean distance matrix completion problems
A Euclidean distance matrix is one in which the (i, j) entry specifies the squared distance between particle i and particle j. Given a partially-specified symmetric matrix A with zero diagonal, the Euclidean distance matrix completion problem (EDMCP) is to determine the unspecified entries to make A a Euclidean distance matrix. We survey three different approaches to solving the EDMCP.We advoca...
متن کاملData completion problems solved as Nash games
Abstract. We consider the Cauchy problem for an elliptic operator, formulated as a Nash game. The over specified Cauchy data are split among two players : the first player solves the elliptic equation with the Dirichlet part of the Cauchy data prescribed over the accessible boundary, and a variable Neumann condition (which we call first player’s strategy) prescribed over the inaccessible part o...
متن کاملBiclique completion problems for multicast network design
This paper considers the problem of aggregating several multicast sessions. A multicast session is defined as a subset of clients requiring the same information. Besides, each client can require several multicast sessions. A telecommunication network cannot manage many multicast sessions at the same time. It is hence necessary to group the sessions into a limited number of clusters. The problem...
متن کاملProtocol Completion Incentive Problems in CVAs
Despite attractive theoretical properties, Vickrey auctions are seldom used due to the risk of information revelation and fear of cheating. CVAs (Cryptographic Vickrey Auctions) have been proposed to protect bidders’ privacy or to prevent cheating by the bid taker. This paper focuses on incentive issues for certain CVAs. First, it defines the CVAs of interest and identifies ideal goals for this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2020
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2020.05.004